Concurrent Computation and Time Complexity Bounds for Algebraic Fractals
نویسندگان
چکیده
This paper considers various parallelization schemes and applies them to concurrent computation of algebraic fractals on IBM SP3 and SGI Onyx 3400 systems. We adapt the time complexity bounds of parallel Monte Carlo methods to predict the execution time behavior of these schemes. Nous étudions plusieurs méthodes de parallélisation appliquées au calcul simultané de plusieurs objets fractals algébriques sur un IBM SP3 et sur un SGI Onyx 3400. Nous adaptons les bornes de complexité temporelles des calculs Monte-Carlo parallèles afin de prédire le comportement du temps d'exécution de ces méthodes.
منابع مشابه
Self-similar fractals and arithmetic dynamics
The concept of self-similarity on subsets of algebraic varieties is defined by considering algebraic endomorphisms of the variety as `similarity' maps. Self-similar fractals are subsets of algebraic varieties which can be written as a finite and disjoint union of `similar' copies. Fractals provide a framework in which, one can unite some results and conjectures in Diophantine g...
متن کاملAre Lower Bounds Easier over the Reals ? Ecole Normale Supérieure De Lyon Are Lower Bounds Easier over the Reals ? Are Lower Bounds Easier over the Reals ?
We show that proving lower bounds in algebraic models of computa tion may not be easier than in the standard Turing machine model For instance a superpolynomial lower bound on the size of an alge braic circuit solving the real knapsack problem or on the running time of a real Turing machine would imply a separation of P from PSPACE A more general result relates parallel complexity classes in bo...
متن کاملAnalytical and Verified Numerical Results Concerning Interval Continuous-time Algebraic Riccati Equations
This paper focuses on studying the interval continuous-time algebraic Riccati equation A∗X + XA + Q − XGX = 0, both from the theoretical aspects and the computational ones. In theoretical parts, we show that Shary’s results for interval linear systems can only be partially generalized to this interval Riccati matrix equation. We then derive an efficient technique for enclosing the united stable...
متن کاملAlgebraic Complexity Theory
Algebraic complexity theory investigates the computational cost of solving problems with an algebraic flavor. Several cost measures are of interest. We consider arithmetic circuits, which can perform the (exact) arithmetic operations +, -, *, / at unit cost, and take their size ( = sequential time) or their depth (=parallel time) as cost functions. This is a natural "structured" model of comput...
متن کاملAlgebra in Computational Complexity
At its core, much of Computational Complexity is concerned with combinatorial objects and structures. But it has often proven true that the best way to prove things about these combinatorial objects is by establishing a connection to a more well-behaved algebraic setting. Indeed, many of the deepest and most powerful results in Computational Complexity rely on algebraic proof techniques. The Ra...
متن کامل